منابع مشابه
Automating the Dependency Pair Method
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area in the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overc...
متن کاملComplexity, Graphs, and the Dependency Pair Method
This paper builds on recent e orts (Hirokawa and Moser, 2008) to exploit the dependency pair method for verifying feasible, i.e., polynomial runtime complexities of term rewrite systems automatically. We extend our earlier results by revisiting dependency graphs in the context of complexity analysis. The obtained new results are easy to implement and considerably extend the analytic power of ou...
متن کاملThe Derivational Complexity Induced by the Dependency Pair Method
We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational complexity of the base techniques employed. In particular we show that the derivational complexity induced by the dependency pair method based on some direct techni...
متن کاملAutomated Complexity Analysis Based on the Dependency Pair Method
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but signi cantly extends the analytic power of existing direct methods. Our ndings extend the class of TRSs whose linear or quadratic runtime complexity can be detected automatically. We provide ample numerical data for ass...
متن کاملA Relative Dependency Pair Framework
Relative rewriting and the dependency pair framework (DP framework) are two strongly related termination methods. In both formalisms we consider whether the combination of two TRSs allows an infinite derivation: Relative termination of R/S can be defined as strong normalization of →R · →S . Finiteness of a DP problem (P,R) can be defined as strong normalization of →P · →R where → allows steps o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.10.004